On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
نویسندگان
چکیده
In Rothvoÿ [2011] it was shown that there exists a 0/1 polytope (a polytope whose vertices are in {0, 1}) such that any higherdimensional polytope projecting to it must have 2 facets, i.e., its linear extension complexity is exponential. The question whether there exists a 0/1 polytope with high PSD extension complexity was left open. We answer this question in the a rmative by showing that there is a 0/1 polytope such that any spectrahedron projecting to it must be the intersection of a semide nite cone of dimension 2 and an a ne space. Our proof relies on a new technique to rescale semide nite factorizations.
منابع مشابه
Maximum semidefinite and linear extension complexity of families of polytopes
We relate the maximum semidefinite and linear extension complexity of a family of polytopes to the cardinality of this family and the minimum pairwise Hausdorff distance of its members. This result directly implies a known lower bound on the maximum semidefinite extension complexity of 0/1-polytopes. We further show how our result can be used to improve on the corresponding bounds known for pol...
متن کاملSome 0/1 polytopes need exponential size extended formulations
We prove that there are 0/1 polytopes P ⊆ R that do not admit a compact LP formulation. More precisely we show that for every n there is a sets X ⊆ {0, 1}n such that conv(X) must have extension complexity at least 2. In other words, every polyhedron Q that can be linearly projected on conv(X) must have exponentially many facets. In fact, the same result also applies if conv(X) is restricted to ...
متن کاملA note on the extension complexity of the knapsack polytope
We show that there are 0-1 and unbounded knapsack polytopes with super-polynomial extension complexity. More specifically, for each n ∈ N we exhibit 0-1 and unbounded knapsack polyhedra in dimension n with extension complexity Ω(2 p n).
متن کاملExtension complexity of polytopes with few vertices or facets
We study the extension complexity of polytopes with few vertices or facets. On the one hand, we provide a complete classification of d-polytopes with at most d + 4 vertices according to their extension complexity: Out of the super-exponentially many d-polytopes with d+4 vertices, all have extension complexity d+ 4 except for some families of size θ(d). On the other hand, we show that generic re...
متن کاملGeneralised probabilistic theories and conic extensions of polytopes
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone C and its dual C∗. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorisation of the corresponding communication matrix M . We also prove an analogue of Holevo’...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 153 شماره
صفحات -
تاریخ انتشار 2013